منابع مشابه
Labelled State Transition Systems
For simplicity, we adopt the following convention: x, x1, x2, y, y1, y2, z, z1, z2, X, X1, X2 are sets, E is a non empty set, e is an element of E, u, v, v1, v2, w, w1, w2 are elements of Eω, F , F1, F2 are subsets of Eω, and k, l are natural numbers. Next we state a number of propositions: (1) For every finite sequence p such that k ∈ dom p holds (〈x〉 a p)(k+ 1) = p(k). (2) For every finite se...
متن کاملLabelled Transition Systems
ion In concurrency theory it is often useful to distinguish between internal actions, that do not admit interactions with the outside world, and external ones. As normally there is no need to distinguish the internal actions from each other, they all have the same name, namely τ . If A is the set of external actions a certain class of systems may perform, then Aτ := A . ∪ {τ}. Systems in that c...
متن کاملBisimulation of Labelled State-to-Function Transition Systems Coalgebraically
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general semirings, equipped with a rich set of higher-order operators. As such, FuTS constitute a convenient modeling instrument to deal with process languages and their quantitative extensions in particular. In this paper, the notion of bisimulation ind...
متن کاملReportrapport Generalizing Finiteness Conditions of Labelled Transition Systems Generalizing Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image...
متن کاملAn Epistemic Logic for Labelled Transition Systems
We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the current state and past history of the execution. This is in the spirit of dynamic epistemic logic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2009
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-009-0019-5